CAN-ORDER POLICY WITH ITEM GROUP IN JOINT REPLENISHMENT PROBLEM
نویسندگان
چکیده
منابع مشابه
A New Clustering Algorithm for Can-order Policies in Joint Replenishment Problem
A novel clustering algorithm is proposed and applied to the multi-item replenishment processing. This new algorithm has two distinguished features: non-binary hierarchical tree and the feature of overlapping clustering. A non-binary hierarchical tree is much smaller than the binary-trees constructed by most traditional algorithms and, therefore, it clearly highlights meaningful clusters which s...
متن کاملThe joint replenishment problem with resource restriction
There are many resource restrictions in real production/inventory systems (for example, budget, storage, transportation capacity, etc.). But unlike other research areas, there is very little research to handle the joint replenishment problem (JRP) with resource restriction. The purpose of this paper is to develop two efficient algorithms for solving these problems. Firstly, we modify the existi...
متن کاملA multi-item periodic replenishment policy with full truckloads
In this paper we consider a stochastic multi item inventory problem. A retailer sells multiple products with stochastic demand and is replenished periodically from a supplier with ample stock. At each order instant it is decided which product to order and how much to order. For the delivery of the products trucks with a finite capacity are available. The dispatched trucks arrive at the retailer...
متن کاملApproximating the Joint replenishment Problem with Deadlines
The objective of the classical Joint Replenishment Problem (JRP) is to minimize ordering costs by combining orders in two stages, first at some retailers, and then at a warehouse. These orders are needed to satisfy demands that appear over time at the retailers. We investigate the natural special case that each demand has a deadline until when it needs to be satisfied. For this case, we present...
متن کاملThe Q(s,S) control policy for the joint replenishment problem extended to the case of correlation among item-demands
We develop an algorithm to compute an optimal Q(s,S) policy for the joint replenishment problem when demands follow a compound correlated Poisson process. It is a non-trivial generalization of the work by Nielsen and Larsen (2005). We make some numerical analyses on two-item problems where we compare the optimal Q(s,S) policy to the optimal uncoordinated (s,S) policies. The results indicate tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2018
ISSN: 2475-885X
DOI: 10.12783/dtetr/icpr2017/17611